MEI: Mutual Enhanced Infinite Community-Topic Model for Analyzing Text-Augmented Social Networks
نویسندگان
چکیده
Community and topic can help summarize the text-augmented social networks. Existing works mixed up community and topic by regarding them as the same. However, there is inherent difference between community and topic such that treating them as the same is not so flexible. We propose a mutual enhanced infinite community-topic model (MEI) to detect communities and topics simultaneously in text-augmented social networks. Community and topic are correlated via community-topic distribution. The mutual enhancement effect between community and topic is validated by introducing two novel measures perplexity with community (perplexityc) and MRK with topic (MRKt). To determine the numbers of communities and topics automatically, Dirichlet Process Mixture model (DPM) and Hierarchical Dirichlet Process mixture model (HDP) are used to model community and topic respectively. We further introduce parameter to model the weight of community and topic responsible for community inference. Experiments on the co-author network built from a subset of DBLP data show MEI outperforms the baseline models in terms of generalization performance. Parameter study shows that MEI is averagely improved by 3.7% and 15.5% in perplexityc and MRKt respectively by setting low weight for topic. We also experimentally validate that MEI can determine the appropriate numbers of communities and topics.
منابع مشابه
MEI: Mutual Enhanced Infinite Generative Model for Simultaneous Community and Topic Detection
Community and topic are two widely studied patterns in social network analysis. However, most existing studies either utilize textual content to improve the community detection or use link structure to guide topic modeling. Recently, some studies take both the link emphasized community and text emphasized topic into account, but community and topic are modeled by using the same latent variable....
متن کاملAnalyzing Latent Topics in Student Confessions Communities on Facebook
Confessions pages have grown popular on social media sites such as Facebook and Twitter, particularly within college communities. Such pages allow users to anonymously submit confessions related to collegiate experience that are subsequently broadcast on a public forum. Because of the anonymous nature of disclosure, we believe that confessions pages are novel data sources from which to discover...
متن کاملMutual Community Detection across Multiple Partially Aligned Social Networks
Community detection in online social networks has been a hot research topic in recent years. Meanwhile, to enjoy more social network services, users nowadays are usually involved in multiple online social networks simultaneously, some of which can share common information and structures. Networks that involve some common users are named as multiple “partially aligned networks”. In this paper, w...
متن کاملAn Optimized Firefly Algorithm based on Cellular Learning Automata for Community Detection in Social Networks
The structure of the community is one of the important features of social networks. A community is a sub graph which nodes have a lot of connections to nodes of inside the community and have very few connections to nodes of outside the community. The objective of community detection is to separate groups or communities that are linked more closely. In fact, community detection is the clustering...
متن کاملAnalyzing the Changes in Online Community based on Topic Model and Self-Organizing Map
In this paper, we propose a new model for two purposes: (1) discovering communities of users on social networks via topics with the temporal factor and (2) analyzing the changes in interested topics and users in communities in each period of time. This model, we use Kohonen network (SelfOrganizing Map) combining with the topic model. After discovering communities, results are shown on output la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 56 شماره
صفحات -
تاریخ انتشار 2013